Linear Algebra using Maple’s LargeExpressions Package
نویسندگان
چکیده
The package LargeExpressions has been available in Maple for a number of years, but it is not well known. It provides tools for managing large expressions. In this paper, we describe a new application of this tool to the LU factoring of matrices. We describe a function that factors a matrix and expresses the results using a hierarchical representation. As part of the LU factoring, we introduce several strategies for pivoting, veiling an expression and zero-recognition in our function. All these strategies can be chosen based on the application. The new function is very flexible and much faster than the existing LUDecomposition command in Maple. Results of benchmark calculations are given.
منابع مشابه
Generic Linear Algebra and Quotient Rings in Maple
The algorithms for linear algebra in the Magma and Axiom computer algebra systems work over an arbitrary ring. For example, the implementation of Gaussian elimination for reducing a matrix to (reduced) row Echelon form works over any field that the user constructs. In contrast, Maple’s facilities for linear algebra in its LinearAlgebra package only work for specific rings. If the input matrix c...
متن کاملExtending Maple Capabilities for Solving and Displaying Inequalities
Solving inequalities is a very important topic in computational algebra. This paper presents a new Maple package, IneqGraphics, for displaying the two-dimensional solution sets of several inequalities of real variables. The package also deals with inequalities involving complex variables by displaying the corresponding solutions on the complex plane. The package provides graphical solutions to ...
متن کاملResolving zero-divisors using Hensel lifting
Algorithms which compute modulo triangular sets must respect the presence of zero-divisors. We present Hensel lifting as a tool for dealing with them. We give an application: a modular algorithm for computing GCDs of univariate polynomials with coefficients modulo a radical triangular set overQ. Our modular algorithm naturally generalizes previous work from algebraic number theory. We have impl...
متن کاملStrongly Connected Graph Components and Computing Characteristic Polynomials of Integer Matrices
Let A be an n× n matrix of integers. We present details of our Maple implementation of a modular method for computing the characteristic polynomial of A. Our implementation considers several different representations for the computation modulo primes, including the use of double precision floats. The algorithm presently implemented in Maple releases 7–10 is the Berkowitz algorithm. We present s...
متن کاملA Package for Generating, Manipulating, and Testing Convolution Algorithms
This report describes a Maple package created for exploring the techniques of Winograd, Nussbaumer, and others for computing “fast” convolution algorithms. After codifying known convolution techniques into a common framework of bilinear algorithms built from parameterized matrices and algebraic operators, Maple’s symbolic and algebraic computation facilities are used to derive and manipulate th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006